<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
      <title>GTL - Graph Template Library: Member List</title>
      <link href="doxygen.css" rel="stylesheet" type="text/css">
  </head>
  <body>
    <p class="links">  
      <a href="../index.html">Home</a> |
      Documentation |
      <a href="../register.html">Download</a> |
      <a href="../platforms.html">Platforms</a> |
      <a href="../refer.html">Projects</a> |      
      <a href="../lists.html">Mailing Lists</a> |
      <a href="../history.html">Version History</a>
    </p>

<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
  <ul>
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    <li class="current"><a href="classes.html"><span>Classes</span></a></li>
    <li><a href="files.html"><span>Files</span></a></li>
    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  </ul>
</div>
<div class="tabs">
  <ul>
    <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
    <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  </ul>
</div>
<h1>topsort Member List</h1>This is the complete list of members for <a class="el" href="a00028.html">topsort</a>, including all inherited members.<p><table>
  <tr class="memlist"><td><a class="el" href="a00008.html#25ae75fe08f1d8c0fedcf9dcae09d092">after_recursive_call_handler</a>(graph &amp;G, edge &amp;e, node &amp;n)</td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#b79e1ddec2f2afdf4b36b10724db8b15">algorithm</a>()</td><td><a class="el" href="a00001.html">algorithm</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#e3f095c9fe6106e82c24543da4844ea3">before_recursive_call_handler</a>(graph &amp;G, edge &amp;e, node &amp;n)</td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#d77350c772b18d305e92d44afe784282">begin</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#70862ea715c52eb95fb704afd3a6e676">calc_comp_num</a>(bool set)</td><td><a class="el" href="a00008.html">dfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#ba070824c0cd45651083a9c62ac34c1a">calc_comp_num</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00028.html#d83c28909478d35c737a2c70506407dd">check</a>(graph &amp;G)</td><td><a class="el" href="a00028.html">topsort</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#1b1c940ed5df7e7b8f825ede1d37f364">comp_num</a>(const node &amp;n) const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#2399808134dbabf6aa5e1b2e35a73954">dfs</a>()</td><td><a class="el" href="a00008.html">dfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#d040ddae37492e18c8e029406d667bd9">dfs_iterator</a> typedef</td><td><a class="el" href="a00008.html">dfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#9309a0573f52643196bef32251cf96df">dfs_num</a>(const node &amp;n) const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#08e6a3b0c1f7c9f7d725b586d5c00857">end</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#b96c7c6183856dd9e356fdcf50835b32">end_handler</a>(graph &amp;G)</td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#73dabe5882226b53494a487b7c34f1d1">entry_handler</a>(graph &amp;G, node &amp;n, node &amp;f)</td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#7c4dc665c18e987c1eb61b69cb582d4f">father</a>(const node &amp;n) const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67106fcf574690bbd6cf710837a169510dd7">GTL_ERROR</a> enum value</td><td><a class="el" href="a00001.html">algorithm</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">GTL_OK</a> enum value</td><td><a class="el" href="a00001.html">algorithm</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00028.html#1cd92994d564acf79c37e40bdb292827">init_handler</a>(graph &amp;G)</td><td><a class="el" href="a00028.html">topsort</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00028.html#6df72e7e38299c30695e9391c3b04383">is_acyclic</a>() const </td><td><a class="el" href="a00028.html">topsort</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00028.html#4401a056e4310ca7eca47587f7da5daf">leave_handler</a>(graph &amp;, node &amp;, node &amp;)</td><td><a class="el" href="a00028.html">topsort</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#3b5fbea7a7baed9946cfb4444a7f20ea">new_start_handler</a>(graph &amp;G, node &amp;n)</td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#1f92658af729dff37e76ad3025b98a79">non_tree_edges_begin</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#f6c9d194226a73515cab7805d1d2a9cf">non_tree_edges_end</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#e7301f3d4417e60fb3a499180375194e">non_tree_edges_iterator</a> typedef</td><td><a class="el" href="a00008.html">dfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#5bffe465fdd599a63a2c3d4593f21187">number_of_reached_nodes</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00028.html#97074494bbdb878a1e3b6da232e965dd">old_adj_node_handler</a>(graph &amp;, edge &amp;, node &amp;)</td><td><a class="el" href="a00028.html">topsort</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#5aa6d81775ad13d92c6e5a7661041866">operator[]</a>(const node &amp;n) const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#174338f8e57a5ba93c08469c2a531a8b">reached</a>(const node &amp;n) const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00028.html#403076f952ef640cb3f52c9b1a495a1f">reset</a>()</td><td><a class="el" href="a00028.html">topsort</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#a084e2afe7b58c7bd94e4a8cf8c630af">roots_begin</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#c074438451c387aaf0cf6aaac79bcd16">roots_end</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#17cb59c8a1fead11fa6b0c85cf5a478e">roots_iterator</a> typedef</td><td><a class="el" href="a00008.html">dfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#f0863b8974d5fd58cd0375c78ed8163b">run</a>(graph &amp;G)</td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#a7c864a6f3a120720138b187b3ed95b5">scan_whole_graph</a>(bool set)</td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#121e68fa166dc109b9f59f5bad3b0a8f">scan_whole_graph</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#ad21fd0d3036350fd341f877d5747852">start_node</a>(const node &amp;n)</td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#0282acea81eb9c0d02ceea109fc25f10">start_node</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#6f54f1c4339eacc8961e795439d4593d">store_non_tree_edges</a>(bool set)</td><td><a class="el" href="a00008.html">dfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#c81e86d2e2b8f4ef5e34470486717dcf">store_non_tree_edges</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#7043f46eb3887cbcbb1391fc783407a4">store_preds</a>(bool set)</td><td><a class="el" href="a00008.html">dfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#5fdfdf59dbd7616167b47013df79364b">store_preds</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00028.html#71069dab2159b75a324f3b8a44a88ced">top_num</a>(const node &amp;n) const </td><td><a class="el" href="a00028.html">topsort</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00028.html#f2b446d051fceb0df31df7057e03025b">top_order_begin</a>() const </td><td><a class="el" href="a00028.html">topsort</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00028.html#b4d0debf92c9e5eeceec48856af4b329">top_order_end</a>() const </td><td><a class="el" href="a00028.html">topsort</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00028.html#76a9055969b9dbf006320040be9fd5e6">topsort</a>()</td><td><a class="el" href="a00028.html">topsort</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#7c13e57ce4138032322bc2230a260b9a">tree_edges_begin</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#3b2de20ab3cff57507f2db17982a6725">tree_edges_end</a>() const </td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#0eee0ddec5343c05f617d6d7aabb6d19">tree_edges_iterator</a> typedef</td><td><a class="el" href="a00008.html">dfs</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#dca9b1e7fa3afd914519a9dbb44e9fd5">~algorithm</a>()</td><td><a class="el" href="a00001.html">algorithm</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00008.html#998e0c28d20bbbbb5a0d705371e4ed00">~dfs</a>()</td><td><a class="el" href="a00008.html">dfs</a></td><td><code> [virtual]</code></td></tr>
</table>    <p class="links">
      <a href="http://www.uni-passau.de/">University of Passau</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/">FMI</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
	Computer Science</a>
    </p>
  <div class="copyright">
      Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
  </div>
</body>
</html>
